Typical circulant double coverings of a circulant graph

نویسندگان

  • Rongquan Feng
  • Jin Ho Kwak
چکیده

Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors. Kwak and Lee (Canad. J. Math. XLII (1990) 747) enumerated the isomorphism classes of graph bundles and those of n-fold coverings with respect to a group of automorphisms of the base graph G which 9x a spanning tree. Hofmeister (Discrete Math. 98 (1991) 175) independently enumerated the isomorphism classes of n-fold graph coverings with respect to the trivial automorphism group of a base graph G. Also, the isomorphism classes of several kinds of graph coverings of a graph G have been enumerated by Hong et al. (Discrete Math. 148 (1996) 85), Hofmeister (Discrete Math. 143 (1995) 87; SIAM J. Discrete Math. 11 (1998) 286), Kwak et al. (SIAM J. Discrete Math. 11 (1998) 273), Kwak and Lee (J. Graph Theory 23 (1996) 105) and some others. In this paper, we aim to enumerate the isomorphism classes of circulant double coverings of a connected circulant graph. The result of our study shows that no double coverings of a circulant graph of valency 3 are circulant. We also enumerate the isomorphism classes of circulant double coverings of a certain type, called a typical covering. c © 2003 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating typical abelian prime-fold coverings of a circulant graph

Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265–272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73–85; R. F...

متن کامل

Dominating Sets in Circulant Graphs

We give an efficient construction of a reasonably small dominating set in a circulant graph on n notes and k distinct chord lengths. This result is based on bounds on some double exponential sums.

متن کامل

Double circulant codes from two class association schemes

Two class association schemes consist of either strongly regular graphs (SRG) or doubly regular tournaments (DRT). We construct self-dual codes from the adjacency matrices of these schemes. This generalizes the construction of Pless ternary Symmetry codes, Karlin binary Double Circulant codes, Calderbank and Sloane quaternary double circulant codes, and Gaborit Quadratic Double Circulant codes ...

متن کامل

General Cyclic Orthogonal Double Covers of Finite Regular Circulant Graphs

An orthogonal double cover (ODC) of a graph H is a collection ( ) { } v G v V H : = ∈  of ( ) V H subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC  of H is cyclic (CODC) if the cyclic group of order ( ) V H is a subgroup of the automorphism group of  . In this paper, we introduce a general orthogonal la...

متن کامل

On extremal double circulant self-dual codes of lengths $90$ and $92$

A classification of extremal double circulant self-dual codes of lengths up to 88 is known. We demonstrate that there is no extremal double circulant self-dual code of length 90. We give a classification of double circulant self-dual [90, 45, 14] codes. In addition, we demonstrate that every double circulant self-dual [90, 45, 14] code has no extremal selfdual neighbor of length 90. Finally, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 277  شماره 

صفحات  -

تاریخ انتشار 2004